SlideShare a Scribd company logo

computer notes - Data Structures - 15

Download as PPT, PDF
E
ecomputernotes

The document discusses level-order traversal of binary trees. Level-order traversal visits all nodes at each level from left to right before moving to the next level. This can be implemented by using a queue, where the left and right children of each dequeued node are enqueued. The code provided traverses a binary tree using this level-order technique.

BusinessTechnology
1 of 55
Download to read offline
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
Class No.15 Data Structures http://ecomputernotes.com
Level-order Traversal There is yet another way of traversing a binary tree that is not related to recursive traversal procedures discussed previously. In level-order traversal, we visit the nodes at each level before proceeding to the next level. At each level, we visit the nodes in a left-to-right order. http://ecomputernotes.com
Level-order Traversal Level-order: 14 4 15 3 9 18 7 16 20 5 17 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
Level-order Traversal How do we do level-order traversal? Surprisingly, if we use a queue instead of a stack, we can visit the nodes in level-order. Here is the code for level-order traversal: http://ecomputernotes.com
Level-order Traversal void levelorder(TreeNode<int>* treeNode) { Queue<TreeNode<int>* > q; if( treeNode == NULL ) return; q.enqueue( treeNode); while( !q.empty() ) { treeNode = q.dequeue(); cout << *(treeNode->getInfo()) << &quot; &quot;; if(treeNode->getLeft() != NULL ) q.enqueue( treeNode->getLeft()); if(treeNode->getRight() != NULL ) q.enqueue( treeNode->getRight()); } cout << endl; }  http://ecomputernotes.com
Level-order Traversal void levelorder(TreeNode<int>* treeNode) { Queue<TreeNode<int>* > q; if( treeNode == NULL ) return; q.enqueue( treeNode); while( !q.empty() ) { treeNode = q.dequeue(); cout << *(treeNode->getInfo()) << &quot; &quot;; if(treeNode->getLeft() != NULL ) q.enqueue( treeNode->getLeft()); if(treeNode->getRight() != NULL ) q.enqueue( treeNode->getRight()); } cout << endl; }  http://ecomputernotes.com
Level-order Traversal void levelorder(TreeNode<int>* treeNode) { Queue<TreeNode<int>* > q; if( treeNode == NULL ) return; q.enqueue( treeNode); while( !q.empty() ) { treeNode = q.dequeue(); cout << *(treeNode->getInfo()) << &quot; &quot;; if(treeNode->getLeft() != NULL ) q.enqueue( treeNode->getLeft()); if(treeNode->getRight() != NULL ) q.enqueue( treeNode->getRight()); } cout << endl; }  http://ecomputernotes.com
Level-order Traversal void levelorder(TreeNode<int>* treeNode) { Queue<TreeNode<int>* > q; if( treeNode == NULL ) return; q.enqueue( treeNode); while( !q.empty() ) { treeNode = q.dequeue(); cout << *(treeNode->getInfo()) << &quot; &quot;; if(treeNode->getLeft() != NULL ) q.enqueue( treeNode->getLeft()); if(treeNode->getRight() != NULL ) q.enqueue( treeNode->getRight()); } cout << endl; }  http://ecomputernotes.com
Level-order Traversal void levelorder(TreeNode<int>* treeNode) { Queue<TreeNode<int>* > q; if( treeNode == NULL ) return; q.enqueue( treeNode); while( !q.empty() ) { treeNode = q.dequeue(); cout << *(treeNode->getInfo()) << &quot; &quot;; if(treeNode->getLeft() != NULL ) q.enqueue( treeNode->getLeft()); if(treeNode->getRight() != NULL ) q.enqueue( treeNode->getRight()); } cout << endl; }  http://ecomputernotes.com
Level-order Traversal void levelorder(TreeNode<int>* treeNode) { Queue<TreeNode<int>* > q; if( treeNode == NULL ) return; q.enqueue( treeNode); while( !q.empty() ) { treeNode = q.dequeue(); cout << *(treeNode->getInfo()) << &quot; &quot;; if(treeNode->getLeft() != NULL ) q.enqueue( treeNode->getLeft()); if(treeNode->getRight() != NULL ) q.enqueue( treeNode->getRight()); } cout << endl; }  http://ecomputernotes.com
Level-order Traversal void levelorder(TreeNode<int>* treeNode) { Queue<TreeNode<int>* > q; if( treeNode == NULL ) return; q.enqueue( treeNode); while( !q.empty() ) { treeNode = q.dequeue(); cout << *(treeNode->getInfo()) << &quot; &quot;; if(treeNode->getLeft() != NULL ) q.enqueue( treeNode->getLeft()); if(treeNode->getRight() != NULL ) q.enqueue( treeNode->getRight()); } cout << endl; }  http://ecomputernotes.com
Level-order Traversal void levelorder(TreeNode<int>* treeNode) { Queue<TreeNode<int>* > q; if( treeNode == NULL ) return; q.enqueue( treeNode); while( !q.empty() ) { treeNode = q.dequeue(); cout << *(treeNode->getInfo()) << &quot; &quot;; if(treeNode->getLeft() != NULL ) q.enqueue( treeNode->getLeft()); if(treeNode->getRight() != NULL ) q.enqueue( treeNode->getRight()); } cout << endl; }  http://ecomputernotes.com
Level-order Traversal Queue: 14 Output: 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
Level-order Traversal Queue: 4 15 Output: 14 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
Level-order Traversal Queue: 15 3 9 Output: 14 4 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
Level-order Traversal Queue: 3 9 18 Output: 14 4 15 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
Level-order Traversal Queue: 9 18 Output: 14 4 15 3 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
Level-order Traversal Queue: 18 7 Output: 14 4 15 3 9 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
Level-order Traversal Queue: 7 16 20 Output: 14 4 15 3 9 18 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
Level-order Traversal Queue: 16 20 5 Output: 14 4 15 3 9 18 7 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
Level-order Traversal Queue: 20 5 17 Output: 14 4 15 3 9 18 7 16 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
Level-order Traversal Queue: 5 17 Output: 14 4 15 3 9 18 7 16 20 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
Level-order Traversal Queue: 17 Output: 14 4 15 3 9 18 7 16 20 5 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
Level-order Traversal Queue: Output: 14 4 15 3 9 18 7 16 20 5 17 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
Storing other Type of Data The examples of binary trees so far have been storing integer data in the tree node. This is surely not a requirement. Any type of data can be stored in a tree node. Here, for example, is the C++ code to build a tree with character strings. http://ecomputernotes.com
Binary Search Tree with Strings void wordTree() { TreeNode<char>* root = new TreeNode<char>(); static char* word[] = &quot;babble&quot;, &quot;fable&quot;, &quot;jacket&quot;, &quot;backup&quot;, &quot;eagle&quot;,&quot;daily&quot;,&quot;gain&quot;,&quot;bandit&quot;,&quot;abandon&quot;, &quot;abash&quot;,&quot;accuse&quot;,&quot;economy&quot;,&quot;adhere&quot;,&quot;advise&quot;,&quot;cease&quot;, &quot;debunk&quot;,&quot;feeder&quot;,&quot;genius&quot;,&quot;fetch&quot;,&quot;chain&quot;, NULL}; root->setInfo( word[0] ); for(i=1; word[i]; i++ ) insert(root, word[i] ); inorder( root ); cout << endl; }  http://ecomputernotes.com
Binary Search Tree with Strings void wordTree() { TreeNode<char>* root = new TreeNode<char>(); static char* word[] = &quot;babble&quot;, &quot;fable&quot;, &quot;jacket&quot;, &quot;backup&quot;, &quot;eagle&quot;,&quot;daily&quot;,&quot;gain&quot;,&quot;bandit&quot;,&quot;abandon&quot;, &quot;abash&quot;,&quot;accuse&quot;,&quot;economy&quot;,&quot;adhere&quot;,&quot;advise&quot;,&quot;cease&quot;, &quot;debunk&quot;,&quot;feeder&quot;,&quot;genius&quot;,&quot;fetch&quot;,&quot;chain&quot;, NULL}; root->setInfo( word[0] ); for(i=1; word[i]; i++ ) insert(root, word[i] ); inorder( root ); cout << endl; }  http://ecomputernotes.com
Binary Search Tree with Strings void wordTree() { TreeNode<char>* root = new TreeNode<char>(); static char* word[] = &quot;babble&quot;, &quot;fable&quot;, &quot;jacket&quot;, &quot;backup&quot;, &quot;eagle&quot;,&quot;daily&quot;,&quot;gain&quot;,&quot;bandit&quot;,&quot;abandon&quot;, &quot;abash&quot;,&quot;accuse&quot;,&quot;economy&quot;,&quot;adhere&quot;,&quot;advise&quot;,&quot;cease&quot;, &quot;debunk&quot;,&quot;feeder&quot;,&quot;genius&quot;,&quot;fetch&quot;,&quot;chain&quot;, NULL}; root->setInfo( word[0] ); for(i=1; word[i]; i++ ) insert(root, word[i] ); inorder( root ); cout << endl; }  http://ecomputernotes.com
Binary Search Tree with Strings void wordTree() { TreeNode<char>* root = new TreeNode<char>(); static char* word[] = &quot;babble&quot;, &quot;fable&quot;, &quot;jacket&quot;, &quot;backup&quot;, &quot;eagle&quot;,&quot;daily&quot;,&quot;gain&quot;,&quot;bandit&quot;,&quot;abandon&quot;, &quot;abash&quot;,&quot;accuse&quot;,&quot;economy&quot;,&quot;adhere&quot;,&quot;advise&quot;,&quot;cease&quot;, &quot;debunk&quot;,&quot;feeder&quot;,&quot;genius&quot;,&quot;fetch&quot;,&quot;chain&quot;, NULL}; root->setInfo( word[0] ); for(i=1; word[i]; i++ ) insert(root, word[i] ); inorder( root ); cout << endl; }  http://ecomputernotes.com
Binary Search Tree with Strings void wordTree() { TreeNode<char>* root = new TreeNode<char>(); static char* word[] = &quot;babble&quot;, &quot;fable&quot;, &quot;jacket&quot;, &quot;backup&quot;, &quot;eagle&quot;,&quot;daily&quot;,&quot;gain&quot;,&quot;bandit&quot;,&quot;abandon&quot;, &quot;abash&quot;,&quot;accuse&quot;,&quot;economy&quot;,&quot;adhere&quot;,&quot;advise&quot;,&quot;cease&quot;, &quot;debunk&quot;,&quot;feeder&quot;,&quot;genius&quot;,&quot;fetch&quot;,&quot;chain&quot;, NULL}; root->setInfo( word[0] ); for(i=1; word[i]; i++ ) insert(root, word[i] ); inorder( root ); cout << endl; }  http://ecomputernotes.com
Binary Search Tree with Strings void insert(TreeNode<char>* root, char* info) { TreeNode<char>* node = new TreeNode<char>(info); TreeNode<char> *p, *q; p = q = root; while( strcmp(info, p->getInfo()) != 0 && q != NULL ) { p = q; if( strcmp(info, p->getInfo()) < 0 ) q = p->getLeft(); else q = p->getRight(); }  http://ecomputernotes.com
Binary Search Tree with Strings void insert(TreeNode<char>* root, char* info) { TreeNode<char>* node = new TreeNode<char>(info); TreeNode<char> *p, *q; p = q = root; while( strcmp(info, p->getInfo()) != 0 && q != NULL ) { p = q; if( strcmp(info, p->getInfo()) < 0 ) q = p->getLeft(); else q = p->getRight(); }  http://ecomputernotes.com
Binary Search Tree with Strings void insert(TreeNode<char>* root, char* info) { TreeNode<char>* node = new TreeNode<char>(info); TreeNode<char> *p, *q; p = q = root; while( strcmp(info, p->getInfo()) != 0 && q != NULL ) { p = q; if( strcmp(info, p->getInfo()) < 0 ) q = p->getLeft(); else q = p->getRight(); }  http://ecomputernotes.com
Binary Search Tree with Strings void insert(TreeNode<char>* root, char* info) { TreeNode<char>* node = new TreeNode<char>(info); TreeNode<char> *p, *q; p = q = root; while( strcmp(info, p->getInfo()) != 0 && q != NULL ) { p = q; if( strcmp(info, p->getInfo()) < 0 ) q = p->getLeft(); else q = p->getRight(); }  http://ecomputernotes.com
Binary Search Tree with Strings void insert(TreeNode<char>* root, char* info) { TreeNode<char>* node = new TreeNode<char>(info); TreeNode<char> *p, *q; p = q = root; while( strcmp(info, p->getInfo()) != 0 && q != NULL ) { p = q; if( strcmp(info, p->getInfo()) < 0 ) q = p->getLeft(); else q = p->getRight(); }  http://ecomputernotes.com
Binary Search Tree with Strings if( strcmp(info, p->getInfo()) == 0 ){ cout << &quot;attempt to insert duplicate: &quot; << *info << endl; delete node; } else if( strcmp(info, p->getInfo()) < 0 ) p->setLeft( node ); else p->setRight( node ); }  http://ecomputernotes.com
Binary Search Tree with Strings if( strcmp(info, p->getInfo()) == 0 ){ cout << &quot;attempt to insert duplicate: &quot; << *info << endl; delete node; } else if( strcmp(info, p->getInfo()) < 0 ) p->setLeft( node ); else p->setRight( node ); }  http://ecomputernotes.com
Binary Search Tree with Strings if( strcmp(info, p->getInfo()) == 0 ){ cout << &quot;attempt to insert duplicate: &quot; << *info << endl; delete node; } else if( strcmp(info, p->getInfo()) < 0 ) p->setLeft( node ); else p->setRight( node ); }  http://ecomputernotes.com
Binary Search Tree with Strings Output: abandon abash accuse adhere advise babble backup bandit cease chain daily debunk eagle economy fable feeder fetch gain genius jacket http://ecomputernotes.com
Binary Search Tree with Strings abandon abash accuse adhere advise babble backup bandit cease chain daily debunk eagle economy fable feeder fetch gain genius jacket Notice that the words are sorted in increasing order when we traversed the tree in inorder manner. http://ecomputernotes.com
Binary Search Tree with Strings abandon abash accuse adhere advise babble backup bandit cease chain daily debunk eagle economy fable feeder fetch gain genius jacket Notice that the words are sorted in increasing order when we traversed the tree in inorder manner. This should not come as a surprise if you consider how we built the BST. http://ecomputernotes.com
Binary Search Tree with Strings abandon abash accuse adhere advise babble backup bandit cease chain daily debunk eagle economy fable feeder fetch gain genius jacket Notice that the words are sorted in increasing order when we traversed the tree in inorder manner. This should not come as a surprise if you consider how we built the BST. For a given node, values less than the info in the node were all in the left subtree and values greater or equal were in the right. http://ecomputernotes.com
Binary Search Tree with Strings abandon abash accuse adhere advise babble backup bandit cease chain daily debunk eagle economy fable feeder fetch gain genius jacket Notice that the words are sorted in increasing order when we traversed the tree in inorder manner. This should not come as a surprise if you consider how we built the BST. For a given node, values less than the info in the node were all in the left subtree and values greater or equal were in the right. Inorder prints the left subtree, then the node finally the right subtree. http://ecomputernotes.com
Binary Search Tree with Strings abandon abash accuse adhere advise babble backup bandit cease chain daily debunk eagle economy fable feeder fetch gain genius jacket Notice that the words are sorted in increasing order when we traversed the tree in inorder manner. This should not come as a surprise if you consider how we built the BST. For a given node, values less than the info in the node were all in the left subtree and values greater or equal were in the right. Inorder prints the left subtree, then the node finally the right subtree. Building a BST and doing an inorder traversal leads to a sorting algorithm. http://ecomputernotes.com
Binary Search Tree with Strings abandon abash accuse adhere advise babble backup bandit cease chain daily debunk eagle economy fable feeder fetch gain genius jacket Notice that the words are sorted in increasing order when we traversed the tree in inorder manner. This should not come as a surprise if you consider how we built the BST. For a given node, values less than the info in the node were all in the left subtree and values greater or equal were in the right. Inorder prints the left subtree, then the node finally the right subtree. Building a BST and doing an inorder traversal leads to a sorting algorithm. http://ecomputernotes.com
Deleting a node in BST As is common with many data structures, the hardest operation is deletion. Once we have found the node to be deleted, we need to consider several possibilities. If the node is a leaf , it can be deleted immediately. http://ecomputernotes.com
Deleting a node in BST If the node has one child, the node can be deleted after its parent adjusts a pointer to bypass the node and connect to inorder successor. 6 2 4 3 1 8 http://ecomputernotes.com
Deleting a node in BST The inorder traversal order has to be maintained after the delete. 6 2 4 3 1 8 6 2 4 3 1 8  http://ecomputernotes.com
Deleting a node in BST The inorder traversal order has to be maintained after the delete. 6 2 4 3 1 8 6 2 4 3 1 8 6 2 3 1 8   http://ecomputernotes.com
Deleting a node in BST The complicated case is when the node to be deleted has both left and right subtrees. The strategy is to replace the data of this node with the smallest data of the right subtree and recursively delete that node. http://ecomputernotes.com
Deleting a node in BST Delete(2): locate inorder successor 6 2 5 3 1 8 4 Inorder successor http://ecomputernotes.com
Deleting a node in BST Delete(2): locate inorder successor 6 2 5 3 1 8 4 Inorder successor Inorder successor will be the left-most node in the right subtree of 2. The inorder successor will not have a left child because if it did, that child would be the left-most node. http://ecomputernotes.com
Deleting a node in BST Delete(2): copy data from inorder successor 6 2 5 3 1 8 4  6 3 5 3 1 8 4 http://ecomputernotes.com
Deleting a node in BST Delete(2): remove the inorder successor 6 2 5 3 1 8 4  6 3 5 3 1 8 4  6 3 5 3 1 8 4 http://ecomputernotes.com
Deleting a node in BST Delete(2)  6 3 5 4 1 8  6 3 5 3 1 8 4 http://ecomputernotes.com

More Related Content

PPT
Computer notes - Binary Search Tree with Strings
ecomputernotes
 
PDF
Clojure 1.1 And Beyond
Mike Fogus
 
PDF
The Magnificent Seven
Mike Fogus
 
PDF
Rich and Snappy Apps (No Scaling Required)
Thomas Fuchs
 
PDF
Os Fetterupdated
oscon2007
 
PDF
Extreme JavaScript Performance
Thomas Fuchs
 
PDF
Better Software: introduction to good code
Giordano Scalzo
 
PDF
Php radomize
do_aki
 
Computer notes - Binary Search Tree with Strings
ecomputernotes
 
Clojure 1.1 And Beyond
Mike Fogus
 
The Magnificent Seven
Mike Fogus
 
Rich and Snappy Apps (No Scaling Required)
Thomas Fuchs
 
Os Fetterupdated
oscon2007
 
Extreme JavaScript Performance
Thomas Fuchs
 
Better Software: introduction to good code
Giordano Scalzo
 
Php radomize
do_aki
 

Similar to computer notes - Data Structures - 15 (20)

PPT
computer notes - Data Structures - 14
ecomputernotes
 
PPT
Computer notes - Recursive
ecomputernotes
 
PPT
computer notes - Data Structures - 13
ecomputernotes
 
PPT
Php Sq Lite
mussawir20
 
PPT
Php My Sql
mussawir20
 
ODP
State Machines to State of the Art
Rowan Merewood
 
ODP
Scala 2 + 2 > 4
Emil Vladev
 
PPTX
Oscon 2010 Specs talk
Eric Torreborre
 
PPT
Arduino section programming slides
vivek k
 
PPT
Embedded Typesafe Domain Specific Languages for Java
Jevgeni Kabanov
 
PPTX
(Slightly) Smarter Smart Pointers
Carlo Pescio
 
PPTX
Groovy
Zen Urban
 
DOCX
#include iostream#include d_node.h #include d_nodel.h.docx
ajoy21
 
PDF
Decoding Kotlin - Your Guide to Solving the Mysterious in Kotlin - Devoxx PL ...
João Esperancinha
 
PPTX
Shkrubbel for Open Web Camp 3
kitthod
 
PPT
Arduino sectionprogramming slides
Jorge Joens
 
PPT
computer notes - Data Structures - 16
ecomputernotes
 
PPT
Falcon初印象
勇浩 赖
 
PDF
MCE^3 - Hannes Verlinde - Let The Symbols Do The Work
PROIDEA
 
PPT
C++ programming
Abdallah Abuouf
 
computer notes - Data Structures - 14
ecomputernotes
 
Computer notes - Recursive
ecomputernotes
 
computer notes - Data Structures - 13
ecomputernotes
 
Php Sq Lite
mussawir20
 
Php My Sql
mussawir20
 
State Machines to State of the Art
Rowan Merewood
 
Scala 2 + 2 > 4
Emil Vladev
 
Oscon 2010 Specs talk
Eric Torreborre
 
Arduino section programming slides
vivek k
 
Embedded Typesafe Domain Specific Languages for Java
Jevgeni Kabanov
 
(Slightly) Smarter Smart Pointers
Carlo Pescio
 
Groovy
Zen Urban
 
#include iostream#include d_node.h #include d_nodel.h.docx
ajoy21
 
Decoding Kotlin - Your Guide to Solving the Mysterious in Kotlin - Devoxx PL ...
João Esperancinha
 
Shkrubbel for Open Web Camp 3
kitthod
 
Arduino sectionprogramming slides
Jorge Joens
 
computer notes - Data Structures - 16
ecomputernotes
 
Falcon初印象
勇浩 赖
 
MCE^3 - Hannes Verlinde - Let The Symbols Do The Work
PROIDEA
 
C++ programming
Abdallah Abuouf
 
Ad

More from ecomputernotes (20)

PPT
computer notes - Data Structures - 30
ecomputernotes
 
PPT
computer notes - Data Structures - 39
ecomputernotes
 
PPT
computer notes - Data Structures - 11
ecomputernotes
 
PPT
computer notes - Data Structures - 20
ecomputernotes
 
DOC
Computer notes - Including Constraints
ecomputernotes
 
DOC
Computer notes - Date time Functions
ecomputernotes
 
DOC
Computer notes - Subqueries
ecomputernotes
 
DOC
Computer notes - Other Database Objects
ecomputernotes
 
PPT
computer notes - Data Structures - 28
ecomputernotes
 
PPT
computer notes - Data Structures - 19
ecomputernotes
 
PPT
computer notes - Data Structures - 31
ecomputernotes
 
PPT
computer notes - Data Structures - 4
ecomputernotes
 
DOC
Computer notes - Advanced Subqueries
ecomputernotes
 
DOC
Computer notes - Aggregating Data Using Group Functions
ecomputernotes
 
PPT
computer notes - Data Structures - 22
ecomputernotes
 
PPT
computer notes - Data Structures - 35
ecomputernotes
 
PPT
computer notes - Data Structures - 36
ecomputernotes
 
DOC
Computer notes - Enhancements to the GROUP BY Clause
ecomputernotes
 
DOC
Computer notes - Manipulating Data
ecomputernotes
 
DOC
Computer notes - Writing Basic SQL SELECT Statements
ecomputernotes
 
computer notes - Data Structures - 30
ecomputernotes
 
computer notes - Data Structures - 39
ecomputernotes
 
computer notes - Data Structures - 11
ecomputernotes
 
computer notes - Data Structures - 20
ecomputernotes
 
Computer notes - Including Constraints
ecomputernotes
 
Computer notes - Date time Functions
ecomputernotes
 
Computer notes - Subqueries
ecomputernotes
 
Computer notes - Other Database Objects
ecomputernotes
 
computer notes - Data Structures - 28
ecomputernotes
 
computer notes - Data Structures - 19
ecomputernotes
 
computer notes - Data Structures - 31
ecomputernotes
 
computer notes - Data Structures - 4
ecomputernotes
 
Computer notes - Advanced Subqueries
ecomputernotes
 
Computer notes - Aggregating Data Using Group Functions
ecomputernotes
 
computer notes - Data Structures - 22
ecomputernotes
 
computer notes - Data Structures - 35
ecomputernotes
 
computer notes - Data Structures - 36
ecomputernotes
 
Computer notes - Enhancements to the GROUP BY Clause
ecomputernotes
 
Computer notes - Manipulating Data
ecomputernotes
 
Computer notes - Writing Basic SQL SELECT Statements
ecomputernotes
 
Ad

Recently uploaded (20)

PDF
Solaris Resources Presentation - Corporate August 2025.pdf
pchambers2
 
DOCX
80 DE ÔN VÀO 10 NĂM 2023vhkkkjjhhhhjjjj
janggookdal
 
PPTX
chapter 2 entrepreneurship full lecture ppt
annejo20
 
PDF
Robin Fischer: A Visionary Leader Making a Difference in Healthcare, One Day ...
The lifescience magaizne
 
PPTX
IITM - FINAL Option - 01 - 12.08.25.pptx
MukeshAssociates2
 
PDF
Environmental Law Communication: Strategies for Advocacy (www.kiu.ac.ug)
publication11
 
PDF
Introduction to Generative Engine Optimization (GEO)
seoplus+
 
PPTX
svnfcksanfskjcsnvvjknsnvsdscnsncxasxa saccacxsax
ergvedfvef sdvsfvdvd
 
PDF
Charisse Litchman: A Maverick Making Neurological Care More Accessible
The lifescience magaizne
 
PDF
Family Law: The Role of Communication in Mediation (www.kiu.ac.ug)
publication11
 
PDF
#1 Safe and Secure Verified Cash App Accounts for Purchase.pdf
Buy Verified Cash App Accounts
 
PDF
Kishore Vora - Best CFO in India to watch in 2025.pdf
insightssuccess2
 
DOCX
Center Enamel A Strategic Partner for the Modernization of Georgia's Chemical...
cecvessels
 
PDF
Ron Thomas - Top Influential Business Leaders Shaping the Modern Industry – 2025
themenabusinessrevie
 
PPT
Lecture 3344;;,,(,(((((((((((((((((((((((
princessbliss09
 
PPTX
operations management : demand supply ch
JayeshJaiswal23
 
PPTX
BUSINESS CYCLE_INFLATION AND UNEMPLOYMENT.pptx
TasmiaThalil
 
DOCX
Center Enamel Powering Innovation and Resilience in the Italian Chemical Indu...
cecvessels
 
PPTX
basic introduction to research chapter 1.pptx
sangeethanagaraj8
 
PDF
ANALYZING THE OPPORTUNITIES OF DIGITAL MARKETING IN BANGLADESH TO PROVIDE AN ...
IJMIT JOURNAL
 
Solaris Resources Presentation - Corporate August 2025.pdf
pchambers2
 
80 DE ÔN VÀO 10 NĂM 2023vhkkkjjhhhhjjjj
janggookdal
 
chapter 2 entrepreneurship full lecture ppt
annejo20
 
Robin Fischer: A Visionary Leader Making a Difference in Healthcare, One Day ...
The lifescience magaizne
 
IITM - FINAL Option - 01 - 12.08.25.pptx
MukeshAssociates2
 
Environmental Law Communication: Strategies for Advocacy (www.kiu.ac.ug)
publication11
 
Introduction to Generative Engine Optimization (GEO)
seoplus+
 
svnfcksanfskjcsnvvjknsnvsdscnsncxasxa saccacxsax
ergvedfvef sdvsfvdvd
 
Charisse Litchman: A Maverick Making Neurological Care More Accessible
The lifescience magaizne
 
Family Law: The Role of Communication in Mediation (www.kiu.ac.ug)
publication11
 
#1 Safe and Secure Verified Cash App Accounts for Purchase.pdf
Buy Verified Cash App Accounts
 
Kishore Vora - Best CFO in India to watch in 2025.pdf
insightssuccess2
 
Center Enamel A Strategic Partner for the Modernization of Georgia's Chemical...
cecvessels
 
Ron Thomas - Top Influential Business Leaders Shaping the Modern Industry – 2025
themenabusinessrevie
 
Lecture 3344;;,,(,(((((((((((((((((((((((
princessbliss09
 
operations management : demand supply ch
JayeshJaiswal23
 
BUSINESS CYCLE_INFLATION AND UNEMPLOYMENT.pptx
TasmiaThalil
 
Center Enamel Powering Innovation and Resilience in the Italian Chemical Indu...
cecvessels
 
basic introduction to research chapter 1.pptx
sangeethanagaraj8
 
ANALYZING THE OPPORTUNITIES OF DIGITAL MARKETING IN BANGLADESH TO PROVIDE AN ...
IJMIT JOURNAL
 

computer notes - Data Structures - 15

  • 1. Class No.15 Data Structures http://ecomputernotes.com
  • 2. Level-order Traversal There is yet another way of traversing a binary tree that is not related to recursive traversal procedures discussed previously. In level-order traversal, we visit the nodes at each level before proceeding to the next level. At each level, we visit the nodes in a left-to-right order. http://ecomputernotes.com
  • 3. Level-order Traversal Level-order: 14 4 15 3 9 18 7 16 20 5 17 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
  • 4. Level-order Traversal How do we do level-order traversal? Surprisingly, if we use a queue instead of a stack, we can visit the nodes in level-order. Here is the code for level-order traversal: http://ecomputernotes.com
  • 5. Level-order Traversal void levelorder(TreeNode<int>* treeNode) { Queue<TreeNode<int>* > q; if( treeNode == NULL ) return; q.enqueue( treeNode); while( !q.empty() ) { treeNode = q.dequeue(); cout << *(treeNode->getInfo()) << &quot; &quot;; if(treeNode->getLeft() != NULL ) q.enqueue( treeNode->getLeft()); if(treeNode->getRight() != NULL ) q.enqueue( treeNode->getRight()); } cout << endl; }  http://ecomputernotes.com
  • 6. Level-order Traversal void levelorder(TreeNode<int>* treeNode) { Queue<TreeNode<int>* > q; if( treeNode == NULL ) return; q.enqueue( treeNode); while( !q.empty() ) { treeNode = q.dequeue(); cout << *(treeNode->getInfo()) << &quot; &quot;; if(treeNode->getLeft() != NULL ) q.enqueue( treeNode->getLeft()); if(treeNode->getRight() != NULL ) q.enqueue( treeNode->getRight()); } cout << endl; }  http://ecomputernotes.com
  • 7. Level-order Traversal void levelorder(TreeNode<int>* treeNode) { Queue<TreeNode<int>* > q; if( treeNode == NULL ) return; q.enqueue( treeNode); while( !q.empty() ) { treeNode = q.dequeue(); cout << *(treeNode->getInfo()) << &quot; &quot;; if(treeNode->getLeft() != NULL ) q.enqueue( treeNode->getLeft()); if(treeNode->getRight() != NULL ) q.enqueue( treeNode->getRight()); } cout << endl; }  http://ecomputernotes.com
  • 8. Level-order Traversal void levelorder(TreeNode<int>* treeNode) { Queue<TreeNode<int>* > q; if( treeNode == NULL ) return; q.enqueue( treeNode); while( !q.empty() ) { treeNode = q.dequeue(); cout << *(treeNode->getInfo()) << &quot; &quot;; if(treeNode->getLeft() != NULL ) q.enqueue( treeNode->getLeft()); if(treeNode->getRight() != NULL ) q.enqueue( treeNode->getRight()); } cout << endl; }  http://ecomputernotes.com
  • 9. Level-order Traversal void levelorder(TreeNode<int>* treeNode) { Queue<TreeNode<int>* > q; if( treeNode == NULL ) return; q.enqueue( treeNode); while( !q.empty() ) { treeNode = q.dequeue(); cout << *(treeNode->getInfo()) << &quot; &quot;; if(treeNode->getLeft() != NULL ) q.enqueue( treeNode->getLeft()); if(treeNode->getRight() != NULL ) q.enqueue( treeNode->getRight()); } cout << endl; }  http://ecomputernotes.com
  • 10. Level-order Traversal void levelorder(TreeNode<int>* treeNode) { Queue<TreeNode<int>* > q; if( treeNode == NULL ) return; q.enqueue( treeNode); while( !q.empty() ) { treeNode = q.dequeue(); cout << *(treeNode->getInfo()) << &quot; &quot;; if(treeNode->getLeft() != NULL ) q.enqueue( treeNode->getLeft()); if(treeNode->getRight() != NULL ) q.enqueue( treeNode->getRight()); } cout << endl; }  http://ecomputernotes.com
  • 11. Level-order Traversal void levelorder(TreeNode<int>* treeNode) { Queue<TreeNode<int>* > q; if( treeNode == NULL ) return; q.enqueue( treeNode); while( !q.empty() ) { treeNode = q.dequeue(); cout << *(treeNode->getInfo()) << &quot; &quot;; if(treeNode->getLeft() != NULL ) q.enqueue( treeNode->getLeft()); if(treeNode->getRight() != NULL ) q.enqueue( treeNode->getRight()); } cout << endl; }  http://ecomputernotes.com
  • 12. Level-order Traversal void levelorder(TreeNode<int>* treeNode) { Queue<TreeNode<int>* > q; if( treeNode == NULL ) return; q.enqueue( treeNode); while( !q.empty() ) { treeNode = q.dequeue(); cout << *(treeNode->getInfo()) << &quot; &quot;; if(treeNode->getLeft() != NULL ) q.enqueue( treeNode->getLeft()); if(treeNode->getRight() != NULL ) q.enqueue( treeNode->getRight()); } cout << endl; }  http://ecomputernotes.com
  • 13. Level-order Traversal Queue: 14 Output: 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
  • 14. Level-order Traversal Queue: 4 15 Output: 14 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
  • 15. Level-order Traversal Queue: 15 3 9 Output: 14 4 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
  • 16. Level-order Traversal Queue: 3 9 18 Output: 14 4 15 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
  • 17. Level-order Traversal Queue: 9 18 Output: 14 4 15 3 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
  • 18. Level-order Traversal Queue: 18 7 Output: 14 4 15 3 9 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
  • 19. Level-order Traversal Queue: 7 16 20 Output: 14 4 15 3 9 18 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
  • 20. Level-order Traversal Queue: 16 20 5 Output: 14 4 15 3 9 18 7 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
  • 21. Level-order Traversal Queue: 20 5 17 Output: 14 4 15 3 9 18 7 16 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
  • 22. Level-order Traversal Queue: 5 17 Output: 14 4 15 3 9 18 7 16 20 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
  • 23. Level-order Traversal Queue: 17 Output: 14 4 15 3 9 18 7 16 20 5 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
  • 24. Level-order Traversal Queue: Output: 14 4 15 3 9 18 7 16 20 5 17 14 4 9 7 3 5 15 18 16 20 17 http://ecomputernotes.com
  • 25. Storing other Type of Data The examples of binary trees so far have been storing integer data in the tree node. This is surely not a requirement. Any type of data can be stored in a tree node. Here, for example, is the C++ code to build a tree with character strings. http://ecomputernotes.com
  • 26. Binary Search Tree with Strings void wordTree() { TreeNode<char>* root = new TreeNode<char>(); static char* word[] = &quot;babble&quot;, &quot;fable&quot;, &quot;jacket&quot;, &quot;backup&quot;, &quot;eagle&quot;,&quot;daily&quot;,&quot;gain&quot;,&quot;bandit&quot;,&quot;abandon&quot;, &quot;abash&quot;,&quot;accuse&quot;,&quot;economy&quot;,&quot;adhere&quot;,&quot;advise&quot;,&quot;cease&quot;, &quot;debunk&quot;,&quot;feeder&quot;,&quot;genius&quot;,&quot;fetch&quot;,&quot;chain&quot;, NULL}; root->setInfo( word[0] ); for(i=1; word[i]; i++ ) insert(root, word[i] ); inorder( root ); cout << endl; }  http://ecomputernotes.com
  • 27. Binary Search Tree with Strings void wordTree() { TreeNode<char>* root = new TreeNode<char>(); static char* word[] = &quot;babble&quot;, &quot;fable&quot;, &quot;jacket&quot;, &quot;backup&quot;, &quot;eagle&quot;,&quot;daily&quot;,&quot;gain&quot;,&quot;bandit&quot;,&quot;abandon&quot;, &quot;abash&quot;,&quot;accuse&quot;,&quot;economy&quot;,&quot;adhere&quot;,&quot;advise&quot;,&quot;cease&quot;, &quot;debunk&quot;,&quot;feeder&quot;,&quot;genius&quot;,&quot;fetch&quot;,&quot;chain&quot;, NULL}; root->setInfo( word[0] ); for(i=1; word[i]; i++ ) insert(root, word[i] ); inorder( root ); cout << endl; }  http://ecomputernotes.com
  • 28. Binary Search Tree with Strings void wordTree() { TreeNode<char>* root = new TreeNode<char>(); static char* word[] = &quot;babble&quot;, &quot;fable&quot;, &quot;jacket&quot;, &quot;backup&quot;, &quot;eagle&quot;,&quot;daily&quot;,&quot;gain&quot;,&quot;bandit&quot;,&quot;abandon&quot;, &quot;abash&quot;,&quot;accuse&quot;,&quot;economy&quot;,&quot;adhere&quot;,&quot;advise&quot;,&quot;cease&quot;, &quot;debunk&quot;,&quot;feeder&quot;,&quot;genius&quot;,&quot;fetch&quot;,&quot;chain&quot;, NULL}; root->setInfo( word[0] ); for(i=1; word[i]; i++ ) insert(root, word[i] ); inorder( root ); cout << endl; }  http://ecomputernotes.com
  • 29. Binary Search Tree with Strings void wordTree() { TreeNode<char>* root = new TreeNode<char>(); static char* word[] = &quot;babble&quot;, &quot;fable&quot;, &quot;jacket&quot;, &quot;backup&quot;, &quot;eagle&quot;,&quot;daily&quot;,&quot;gain&quot;,&quot;bandit&quot;,&quot;abandon&quot;, &quot;abash&quot;,&quot;accuse&quot;,&quot;economy&quot;,&quot;adhere&quot;,&quot;advise&quot;,&quot;cease&quot;, &quot;debunk&quot;,&quot;feeder&quot;,&quot;genius&quot;,&quot;fetch&quot;,&quot;chain&quot;, NULL}; root->setInfo( word[0] ); for(i=1; word[i]; i++ ) insert(root, word[i] ); inorder( root ); cout << endl; }  http://ecomputernotes.com
  • 30. Binary Search Tree with Strings void wordTree() { TreeNode<char>* root = new TreeNode<char>(); static char* word[] = &quot;babble&quot;, &quot;fable&quot;, &quot;jacket&quot;, &quot;backup&quot;, &quot;eagle&quot;,&quot;daily&quot;,&quot;gain&quot;,&quot;bandit&quot;,&quot;abandon&quot;, &quot;abash&quot;,&quot;accuse&quot;,&quot;economy&quot;,&quot;adhere&quot;,&quot;advise&quot;,&quot;cease&quot;, &quot;debunk&quot;,&quot;feeder&quot;,&quot;genius&quot;,&quot;fetch&quot;,&quot;chain&quot;, NULL}; root->setInfo( word[0] ); for(i=1; word[i]; i++ ) insert(root, word[i] ); inorder( root ); cout << endl; }  http://ecomputernotes.com
  • 31. Binary Search Tree with Strings void insert(TreeNode<char>* root, char* info) { TreeNode<char>* node = new TreeNode<char>(info); TreeNode<char> *p, *q; p = q = root; while( strcmp(info, p->getInfo()) != 0 && q != NULL ) { p = q; if( strcmp(info, p->getInfo()) < 0 ) q = p->getLeft(); else q = p->getRight(); }  http://ecomputernotes.com
  • 32. Binary Search Tree with Strings void insert(TreeNode<char>* root, char* info) { TreeNode<char>* node = new TreeNode<char>(info); TreeNode<char> *p, *q; p = q = root; while( strcmp(info, p->getInfo()) != 0 && q != NULL ) { p = q; if( strcmp(info, p->getInfo()) < 0 ) q = p->getLeft(); else q = p->getRight(); }  http://ecomputernotes.com
  • 33. Binary Search Tree with Strings void insert(TreeNode<char>* root, char* info) { TreeNode<char>* node = new TreeNode<char>(info); TreeNode<char> *p, *q; p = q = root; while( strcmp(info, p->getInfo()) != 0 && q != NULL ) { p = q; if( strcmp(info, p->getInfo()) < 0 ) q = p->getLeft(); else q = p->getRight(); }  http://ecomputernotes.com
  • 34. Binary Search Tree with Strings void insert(TreeNode<char>* root, char* info) { TreeNode<char>* node = new TreeNode<char>(info); TreeNode<char> *p, *q; p = q = root; while( strcmp(info, p->getInfo()) != 0 && q != NULL ) { p = q; if( strcmp(info, p->getInfo()) < 0 ) q = p->getLeft(); else q = p->getRight(); }  http://ecomputernotes.com
  • 35. Binary Search Tree with Strings void insert(TreeNode<char>* root, char* info) { TreeNode<char>* node = new TreeNode<char>(info); TreeNode<char> *p, *q; p = q = root; while( strcmp(info, p->getInfo()) != 0 && q != NULL ) { p = q; if( strcmp(info, p->getInfo()) < 0 ) q = p->getLeft(); else q = p->getRight(); }  http://ecomputernotes.com
  • 36. Binary Search Tree with Strings if( strcmp(info, p->getInfo()) == 0 ){ cout << &quot;attempt to insert duplicate: &quot; << *info << endl; delete node; } else if( strcmp(info, p->getInfo()) < 0 ) p->setLeft( node ); else p->setRight( node ); }  http://ecomputernotes.com
  • 37. Binary Search Tree with Strings if( strcmp(info, p->getInfo()) == 0 ){ cout << &quot;attempt to insert duplicate: &quot; << *info << endl; delete node; } else if( strcmp(info, p->getInfo()) < 0 ) p->setLeft( node ); else p->setRight( node ); }  http://ecomputernotes.com
  • 38. Binary Search Tree with Strings if( strcmp(info, p->getInfo()) == 0 ){ cout << &quot;attempt to insert duplicate: &quot; << *info << endl; delete node; } else if( strcmp(info, p->getInfo()) < 0 ) p->setLeft( node ); else p->setRight( node ); }  http://ecomputernotes.com
  • 39. Binary Search Tree with Strings Output: abandon abash accuse adhere advise babble backup bandit cease chain daily debunk eagle economy fable feeder fetch gain genius jacket http://ecomputernotes.com
  • 40. Binary Search Tree with Strings abandon abash accuse adhere advise babble backup bandit cease chain daily debunk eagle economy fable feeder fetch gain genius jacket Notice that the words are sorted in increasing order when we traversed the tree in inorder manner. http://ecomputernotes.com
  • 41. Binary Search Tree with Strings abandon abash accuse adhere advise babble backup bandit cease chain daily debunk eagle economy fable feeder fetch gain genius jacket Notice that the words are sorted in increasing order when we traversed the tree in inorder manner. This should not come as a surprise if you consider how we built the BST. http://ecomputernotes.com
  • 42. Binary Search Tree with Strings abandon abash accuse adhere advise babble backup bandit cease chain daily debunk eagle economy fable feeder fetch gain genius jacket Notice that the words are sorted in increasing order when we traversed the tree in inorder manner. This should not come as a surprise if you consider how we built the BST. For a given node, values less than the info in the node were all in the left subtree and values greater or equal were in the right. http://ecomputernotes.com
  • 43. Binary Search Tree with Strings abandon abash accuse adhere advise babble backup bandit cease chain daily debunk eagle economy fable feeder fetch gain genius jacket Notice that the words are sorted in increasing order when we traversed the tree in inorder manner. This should not come as a surprise if you consider how we built the BST. For a given node, values less than the info in the node were all in the left subtree and values greater or equal were in the right. Inorder prints the left subtree, then the node finally the right subtree. http://ecomputernotes.com
  • 44. Binary Search Tree with Strings abandon abash accuse adhere advise babble backup bandit cease chain daily debunk eagle economy fable feeder fetch gain genius jacket Notice that the words are sorted in increasing order when we traversed the tree in inorder manner. This should not come as a surprise if you consider how we built the BST. For a given node, values less than the info in the node were all in the left subtree and values greater or equal were in the right. Inorder prints the left subtree, then the node finally the right subtree. Building a BST and doing an inorder traversal leads to a sorting algorithm. http://ecomputernotes.com
  • 45. Binary Search Tree with Strings abandon abash accuse adhere advise babble backup bandit cease chain daily debunk eagle economy fable feeder fetch gain genius jacket Notice that the words are sorted in increasing order when we traversed the tree in inorder manner. This should not come as a surprise if you consider how we built the BST. For a given node, values less than the info in the node were all in the left subtree and values greater or equal were in the right. Inorder prints the left subtree, then the node finally the right subtree. Building a BST and doing an inorder traversal leads to a sorting algorithm. http://ecomputernotes.com
  • 46. Deleting a node in BST As is common with many data structures, the hardest operation is deletion. Once we have found the node to be deleted, we need to consider several possibilities. If the node is a leaf , it can be deleted immediately. http://ecomputernotes.com
  • 47. Deleting a node in BST If the node has one child, the node can be deleted after its parent adjusts a pointer to bypass the node and connect to inorder successor. 6 2 4 3 1 8 http://ecomputernotes.com
  • 48. Deleting a node in BST The inorder traversal order has to be maintained after the delete. 6 2 4 3 1 8 6 2 4 3 1 8  http://ecomputernotes.com
  • 49. Deleting a node in BST The inorder traversal order has to be maintained after the delete. 6 2 4 3 1 8 6 2 4 3 1 8 6 2 3 1 8   http://ecomputernotes.com
  • 50. Deleting a node in BST The complicated case is when the node to be deleted has both left and right subtrees. The strategy is to replace the data of this node with the smallest data of the right subtree and recursively delete that node. http://ecomputernotes.com
  • 51. Deleting a node in BST Delete(2): locate inorder successor 6 2 5 3 1 8 4 Inorder successor http://ecomputernotes.com
  • 52. Deleting a node in BST Delete(2): locate inorder successor 6 2 5 3 1 8 4 Inorder successor Inorder successor will be the left-most node in the right subtree of 2. The inorder successor will not have a left child because if it did, that child would be the left-most node. http://ecomputernotes.com
  • 53. Deleting a node in BST Delete(2): copy data from inorder successor 6 2 5 3 1 8 4  6 3 5 3 1 8 4 http://ecomputernotes.com
  • 54. Deleting a node in BST Delete(2): remove the inorder successor 6 2 5 3 1 8 4  6 3 5 3 1 8 4  6 3 5 3 1 8 4 http://ecomputernotes.com
  • 55. Deleting a node in BST Delete(2)  6 3 5 4 1 8  6 3 5 3 1 8 4 http://ecomputernotes.com

Editor's Notes

  • #4: End of lecture 14
  • #52: Start lecture 16
  • #56: End of lecture 15